Planar Characterization – Graph Domination Graphs
نویسندگان
چکیده
منابع مشابه
Planar Graph Characterization - Using γ - Stable Graphs
A graph G is said to be γ stable if γ(Gxy) = γ(G), for all x, y ∈ V (G), x is not adjacent to y, where Gxy denotes the graph obtained by merging the vertices x, y. In this paper we have provided a necessary and sufficient condition for Ḡ to be γ stable, where Ḡ denotes the complement of G. We have obtained a characterization of planar graphs when G and Ḡ are γ stable graphs. Key–Words: γ stable...
متن کاملGlobal Domination in Planar Graphs
For any graph G = (V, E), D V is a global dominating set if D dominates both G and its complement G . The global domination number g(G) of a graph G is the fewest number of vertices required of a global dominating set. In general, max{(G), (G )} ≤ g(G) ≤ (G)+(G ), where (G) and (G ) are the respective domination numbers of G and G . We show, when G is a planar graph, that g(G) ≤ max{...
متن کاملDomination in planar graphs with small diameter
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar graphs of diameter four having arbitrarily large domination numbers. In this paper we improve on their results. We prove that there is in fact a uni...
متن کاملPower domination in maximal planar graphs
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation. For measurement devices placed on a set S of vertices of a graph G, the set of monitored vertices is initially the set S together with all its neighbors. The...
متن کاملCapacitated Domination: Constant Factor Approximations for Planar Graphs
We consider the capacitated domination problem, which models a service-requirement assigning scenario and which is also a generalization of the dominating set problem. In this problem, we are given a graph with three parameters defined on the vertex set, which are cost, capacity, and demand. The objective of this problem is to compute a demand assignment of least cost, such that the demand of e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.26634